The tree Constraint
نویسندگان
چکیده
This article presents an arc-consistency algorithm for the tree constraint, which enforces the partitioning of a digraph G = (V, E) into a set of vertex-disjoint anti-arborescences. It provides a necessary and sufficient condition for checking the tree constraint in O(|V| + |E|) time, as well as a complete filtering algorithm takingO(|V| · |E|) time.
منابع مشابه
Complexity of K-Tree Structured Constraint Satisfaction Problems
Trees have played a key role in the study of constraint satisfaction problems because problems with tree structure can be solved efficiently. It is shown here that a family of generalized trees, k-trees, can offer increasing representational complexity for constraint satisfaction problems, while maintaining a bound on computational complexity linear in the number of variables and exponential in...
متن کاملSteiner Tree Problems with Side Constraints Using Constraint Programming
The Steiner Tree Problem is a well know NP-complete problem that is well studied and for which fast algorithms are already available. Nonetheless, in the real world the Steiner Tree Problem is almost always accompanied by side constraints which means these approaches cannot be applied. For many problems with side constraints, only approximation algorithms are known. We introduce here a propagat...
متن کاملKnowledge Reuse for Open Constraint-Based Inference
Open constraint programming, including open constraint satisfaction (Open COP) and open constraint optimization (Open COP), is an extended constraint programming framework designed to model and solve practical problems with openworld settings. We extend open constraint programming to the Open Constraint-Based Inference (Open CBI) framework based on the unified semiring-based CBI framework. The ...
متن کاملOverview of the Monadic Constraint Programming Framework
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. The Monadic Constraint Programming framework gives a monadic def...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملConstraint Search Trees
This paper deenes constraint search trees, a general tree data structure for storing and accessing items with constraints as keys. Constraint search trees can mimic binary search trees, radix search trees, k-d trees, R-trees and many other kinds of search trees. The unifying framework of constraint search trees immediately suggests new kinds of spatial data indexing techniques, as well as showi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005